A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
نویسندگان
چکیده
منابع مشابه
A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we emphasize the differences in operations between bulk ports and container terminals which emphasizes the need to devise ...
متن کاملIntegrated Berth Allocation and Yard Assignment in Bulk Ports using Column Generation
One of the primary modes for worldwide trade of goods is maritime transport, which is exposed to rapid growth. In order to handle the increase of the traffic in ports, optimization of port operations has been studied and implemented in the past. In container terminals, significant amount of work has been done in the field of large scale optimization. In published literature, the main focus lies...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملThe Tactical Berth Allocation Problem with Quay Crane Assignment and Transshipment-related Quadratic Yard Costs
In this paper we integrate two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working shift). They are indeed strictly correlated, as the QC profile assigned t...
متن کاملA Branch-and-Price Algorithm for the Generalized Assignment Problem
The generalized assignment problem examines the maximum pro t assignment of jobs to agents such that each job is assigned to precisely one agent subject to capacity restrictions on the agents A new algorithm for the generalized assignment problem is presented that employs both column generation and branch and bound to obtain optimal integer solutions to a set partitioning formulation of the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2014
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2013.08.015